Section: New Results

SMT automation for Ssreflect

Participants : Antoine Grospellier, Laurent Théry [correspondant] .

The proof of the Feit-Thompson theorem (also known as the odd-order theorem) has been carried on with little use of automation. We have customised the existing connection between Coq and SMT solvers using Why to accomodate Ssreflect specificities. The preliminary results are encouraging.